home *** CD-ROM | disk | FTP | other *** search
- Path: mail2news.demon.co.uk!genesis.demon.co.uk
- From: Lawrence Kirby <fred@genesis.demon.co.uk>
- Newsgroups: comp.lang.c
- Subject: Re: Huffman encoding
- Date: Wed, 06 Mar 96 00:46:14 GMT
- Organization: none
- Message-ID: <826073174snz@genesis.demon.co.uk>
- References: <4h00ci$euq@garuda.csulb.edu> <4h2fo4$4te@linet06.li.net> <4h4oph$kjj@texas.nwlink.com> <4heqc2$b7t@kannews.ca.newbridge.com>
- Reply-To: fred@genesis.demon.co.uk
- X-NNTP-Posting-Host: genesis.demon.co.uk
- X-Newsreader: Demon Internet Simple News v1.27
- X-Mail2News-Path: genesis.demon.co.uk
-
- In article <4heqc2$b7t@kannews.ca.newbridge.com>
- gminer@Newbridge.COM "Glen Miner" writes:
-
- >Excuse me? I was under the impressiong that Huffman coding was an error
- >detection scheme, but inserting parity bits in the data stream. It is
- >renowned for it's natural ability to not only detect bad bits, but to
- >determine which bit needs to be flipped.
-
- You are probably thinking of Hamming code which is used in things like ECC
- memory. Huffman coding essentially replaces characters (or symbols in general)
- by a token whose size depends on the frequency of the symbol i.e. more
- frequent symbols are allocated smaller tokens.
-
- >Not that this post isn't off topic, but it certainly doesn't belong in
- >comp.compression :)
-
- Discussion of whether something is a compression algirithm or not is far
- more relevant to comp.compression than comp.lang.c. I expect you'll find
- more information in their FAQ.
-
- --
- -----------------------------------------
- Lawrence Kirby | fred@genesis.demon.co.uk
- Wilts, England | 70734.126@compuserve.com
- -----------------------------------------
-